Single-Car Routing in Rail Freight Transport

Cars in rail freight service follow prescribed routes from their origin via intermediate shunting yards to their destination. The goal in designing such routes is to reduce the number of trains and their travel distances. Various real-world hard constraints make the problem difficult to formulate and also to solve. We present integer programming formulations for this car routing problem arising at the largest European railway company and discuss their pros and cons.